Deaccumulation - Improving Provability

نویسندگان

  • Jürgen Giesl
  • Armin Kühnemann
  • Janis Voigtländer
چکیده

Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating arguments. In particular, this holds for tail-recursive functions that correspond to imperative programs, but also for programs with nested recursion. Based on results from the theory of tree transducers, we develop an automatic transformation technique. It transforms accumulative functional programs into non-accumulative ones, which are much better suited for automated verification by induction theorem provers. Hence, in contrast to classical program transformations aiming at improving the efficiency, the goal of our deaccumulation technique is to improve the provability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deaccumulation techniques for improving provability

Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arguments. Using concepts from the theory of tree transducers and extending on earlier work, the paper develops automatic transformations from accumulative functional programs into nonaccumulative ones, which are much bett...

متن کامل

Project Report Logic Programming in Constructive Provability Logic 15-816 Modal Logic

We present a novel formulation of CPL, a constructive logic of provability that is closely connected to the Gödel-Löb logic of provability. Our logical formulation allows modal operators to talk about both provability and non-provability of propositions at reachable worlds. We use this logic as a basis for a discussion of negation in logic programming.

متن کامل

On Provability Logic

This is an introductory paper about provability logic, a modal propositional logic in which necessity is interpreted as formal provability. We discuss the ideas that led to establishing this logic, we survey its history and the most important results, and we emphasize its applications in metamathematics. Stress is put on the use of Gentzen calculus for provability logic. We sketch our version o...

متن کامل

Constructive Provability Logic 1

We present two variants of an intuitionistic sequent calculus that validates the Löb rule and permits logical reflection over provability. We explore properties of both variants of this logic, which we call constructive provability logic due to its close ties to Gödel-Löb provability logic.

متن کامل

On Two Models of Provability

Gödel’s modal logic approach to analyzing provability attracted a great deal of attention and eventually led to two distinct mathematical models. The first is the modal logic GL, also known as the Provability Logic, which was shown in 1979 by Solovay to be the logic of the formal provability predicate. The second is Gödel’s original modal logic of provability S4, together with its explicit coun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003